Fibonacci Nim and a Full Characterization of Winning Moves
نویسندگان
چکیده
In this paper we will fully characterize all types of winning moves in the “takeaway” game of Fibonacci Nim. We prove the known winning algorithm as a corollary of the general winning algorithm and then show that no other winning algorithms exist. As a by-product of our investigation of the game, we will develop useful properties of Fibonacci numbers. We conclude with an exploration of the probability that unskilled player may beat a skilled player and show that as the number of tokens increase, this probability goes to zero exponentially.
منابع مشابه
Wythoff'snim and Fibonacci Representations
Our aim in what follows is to show how Fibonacci representations play a role in determining winning moves for Wythoffs Nim [1, 2] very analogous to the role of binary representations in Bouton's Nim [3 ] . The particulars of these two games can be found in the preceding references, but for the convenience of the reader, we briefly recount the rules of play. In Bouton's Nim (usually referred to ...
متن کاملHow Far Can Nim in Disguise Be Stretched?
A move in the game of nim consists of taking any positive number of tokens from a single pile. Suppose we add the class of moves of taking a nonnegative number of tokens jointly from all the piles. We give a complete answer to the question which moves in the class can be adjoined without changing the winning strategy of nim. The results apply to other combinatorial games with unbounded Sprague-...
متن کامل2-pile Nim with a Restricted Number of Move-size Imitations
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint: Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in “a strict sequence of previous player next player moves”, such an imitation takes place, the ...
متن کاملEvolving Winning Strategies for Nim-like Games
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this paper. The winning strategy is computed by using the Multi Expression Programming (MEP) technique a fast and efficient variant of the Genetic Programming (GP). Each play strategy is represented by a mathematical expression that contains mathematical operators (such as +, -, *, mod, div, and , or, ...
متن کاملWinning Strategies and Complexity of Nim-Type Computer Game on Plane
A Nim-type computer game of strategy on plane is described in this paper. It is demonstrated that winning strategies of this two-person game are determined by a system of equations with two unknown integer sequences. Properties of winning points/states are discussed and an O(loglogn) algorithm for the winning states is provided. Two varieties of the Game are also introduced and their winning st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014